Location-Dependent Query Processing Under Soft Real-Time Constraints

An Architecture for Location Dependent Query Processing

As the mobility of people increases, anytime, anywhere computing has become a must. With the advances in wireless communications, the geographical position of the mobile user can be estimated accurately enough to be used to access data dependent on it. Location awareness then enables new kinds of services specific to localized information. While this provides great flexibility for the end user,...

Semantic Caching in Location-Dependent Query Processing

Chapter XIII Location - Dependent Query Processing Benchmark

Benchmarks define techniques which can be followed to determine the effectiveness of a given software or hardware design. Ever since the development of the Wisconsin Benchmark and subsequent transaction-processing (TPC) benchmarks, there has been a concensus and general acceptance of these performance comparison tools. However, these benchmarks are not sufficient to determine the performance of...

Discrete-Time Scheduling under Real-Time Constraints

We introduce a new method for scheduling under real-time constraints that is suitable for synchronous system implementations. The input specification is in the form of timing diagrams in which the occurrence times of signal transitions or actions are related by linear constraints, expressing the assumptions on the input actions (the environment) and the commitments on the output actions. Provid...

Real-Time Scheduling Under Time-Interval Constraints

This paper presents a new task model where jobs are divided into segments A, B and C. Segment B has a specific time-interval where it should execute to fulfill some application constraints. We consider the execution of B as valid if performed inside that time-interval, otherwise, its contribution may be valueless to its task. We adapt some scheduling approaches from the literature and present a...